Overflow Probability of Variable-length Codes with Codeword Cost

نویسنده

  • Ryo Nomura
چکیده

Lossless variable-length source coding with codeword cost is considered for general sources. The problem setting, where we impose on unequal costs on code symbols, is called the variablelength coding with codeword cost. In this problem, the infimum of average codeword cost have been determined for general sources. On the other hand, overflow probability, which is defined as the probability of codeword cost being above a threshold, have not been considered yet. In this paper, we determine the infimum of achievable threshold in the first-order sense and the secondorder sense for general sources and compute it for some special sources such as i.i.d. sources and mixed sources. A relationship between the overflow probability of variable-length coding and the error probability of fixed-length coding is also revealed. Our analysis is based on the informationspectrum methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Information-Theoretic Study on Variable-Length Source Coding with Unequal Cost

– Abstract – In the variable-length source coding, we may consider vary zestful problem as follows: If each code symbol is given prescribed cost to transmit or record, what code is optimal? This problem is substantial from not only theoretical viewpoints but also engineering points of view. Because, in practical systems of communication or recording , it may reasonable to consider unequal costs...

متن کامل

Universal coding with minimum probability of codeword length overflow

-Lossless block-to-variable length source coding is studied for finite-state, finite-alphabet sources. We aim to minimize the probability that the normalized length of the codeword will exceed a given threshold B, subject to the Kraft inequality. It is shown that the Lempel-Ziv (LZ) algorithm asymptotically attains the optimal performance in the sense just defined, independently of the source a...

متن کامل

Self-Synchronizing Reversible Variable Length Codes

A reversible variable-length code (RVLC) is a code in which the bit stream formed by a portion of a codeword, or by the overlapped portion of two or more adjacent codewords, is not a valid codeword. A self-synchronizing RVLC allows for a sequence of codewords to be decoded either backwards or forwards without any external synchronization. In this article, we present an algorithm for constructin...

متن کامل

Cdmtcs Research Report Series Variable-length Codes for Sources with Equiprobable Symbols Variable-length Codes for Sources with Equiprobable Symbols

Variable-length codes can provide compression for data communication. Such codes may be used not only when the source statistics is known but also when we do not know the source probability distribution, and a source with equal symbol probabilities (equiprobable symbols) can or has to be assumed. This paper presents variable-length codes with code words that di er in length by at most one code ...

متن کامل

Error states and synchronization recovery for variable length codes

The Synchronization Variable length codes. The Construction of Variable length codes with good Synchronization Properties. On the Expected codeword Length per Symbol of optimal prefix codes for extended Sources.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1310.2001  شماره 

صفحات  -

تاریخ انتشار 2013